Polynomial approximation with bounds
نویسندگان
چکیده
منابع مشابه
On Improved Degree Lower Bounds for Polynomial Approximation
A polynomial P ∈ F[X1, . . . , Xn] is said to ε-approximate a boolean function F : {0, 1} → {0, 1} under distribution D over {0, 1} if Prx∼D[P (x) 6= F (x)] ≤ ε. Smolensky (1987) showed that for any constant primes p 6= q, any polynomial P ∈ Fp[x1, . . . , xn] that ( 1 2q − Ω(1))-approximates the boolean function MODq : {0, 1} → {0, 1} – which accepts its input iff the number of ones is non-zer...
متن کاملPolynomial Approximation
Polynomials are very simple mathematical functions which have the flexibility to represent very general nonlinear relationships. Approximation of more complicated functions by polynomials is a basic building block for many numerical techniques. This article considers two distinct but related applications. The first is polynomial regression in which polynomials are used to model a nonlinear rela...
متن کاملQuantum Sphere-Packing Bounds with Polynomial Prefactors
We study lower bounds on the optimal error probability in classical coding over classicalquantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for classical-quantum channels; however, the exponents in their bounds only coincide when the channel is classical. In this paper, we show that these two exponents admit a v...
متن کاملPolynomial Bounds for Decoupling, with Applications
Let f(x) = f(x1, . . . , xn) = ∑ |S|≤k aS ∏ i∈S xi be an n-variate real multilinear polynomial of degree at most k, where S ⊆ [n] = {1, 2, . . . , n}. For its one-block decoupled version,
متن کاملEnumeration Reducibility with Polynomial Time Bounds
We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analysis of this reducibility and its relationship with non deterministic polynomial time conjunctive reducibility. We discuss the basic properties of the degree structure induced by ≤pe over the computable sets and we show how to construct meets and joins. We are thus able to prove that this degree structure is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1982
ISSN: 0021-9045
DOI: 10.1016/0021-9045(82)90080-6